Golden Space–Time Trellis Coded Modulation

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Golden Space-Time Trellis Coded Modulation

In this paper, we present a multidimensional trellis coded modulation scheme for a high rate 2 2 multiple-input multiple-output system over slow fading channels. Set partitioning of the Golden code [9] is designed speci cally to increase the minimum determinant. The branches of the outer trellis code are labeled with these partitions and Viterbi algorithm is applied for trellis decoding. In ord...

متن کامل

Punctured Trellis-Coded Modulation

THIS PAPER IS ELIGIBLE FOR THE STUDENT PAPER AWARD In classic trellis-coded modulation (TCM) signal constellations of twice the cardinality are applied when compared to an uncoded transmission enabling transmission of one bit of redundancy per PAM-symbol, i.e., rates of K K+1 when 2 denotes the cardinality of the signal constellation. In order to support different rates, multi-dimensional (i.e....

متن کامل

Staggered Trellis Coded Modulation

A special construction method for parallel concatenated trellis coded modulation, namely staggered trellis coded modulation, is presented. This coding scheme is similar to that of the recently introduced binary laminated turbo codes and it comprises a convolutional structure due to an additional block-wise memory. The encoder and a possible decoder for this new code construction is presented an...

متن کامل

Multiple trellis coded modulation (MTCM)

Conventional trellis coding outputs one channel symbol per trellis branch. channel symbol combination of performance ga Here we introduce the notion of multiple trellis coding wherein more than one the a per trellis branch is transmitted. It is shown that multiple trellis coding with M-ary modulation yields n with symmetric signal sets comparable to that prev ously achieved only with signal con...

متن کامل

Trellis coded modulation to improve dirty paper trellis watermarking

Lattice codes and quantization-based techniques have received considerable attention as a method of digital watermarking with side information. However, these algorithms are also recognized to be highly sensitive to common signal processing primitives such as valuemetric scaling, e.g. changes in volume of a song, or re-quantization, e.g. JPEG compression. Hence, it is reasonable to investigate ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Information Theory

سال: 2007

ISSN: 0018-9448

DOI: 10.1109/tit.2007.894626